Statistical Applications for Equivariant Matrices

نویسنده

  • S. H. ALKARNI
چکیده

Solving linear system of equations Ax = b enters into many scientific applications. In this paper, we consider a special kind of linear systems, the matrix A is an equivariant matrix with respect to a finite group of permutations. Examples of this kind are special Toeplitz matrices, circulant matrices, and others. The equivariance property of A may be used to reduce the cost of computation for solving linear systems. We will show that the quadratic form is invariant with respect to a permutation matrix. This helps to know the multiplicity of eigenvalues of a matrix and yields corresponding eigenvectors at a low computational cost. Applications for such systems from the area of statistics will be presented. These include Fourier transforms on a symmetric group as part of statistical analysis of rankings in an election, spectral analysis in stationary processes, prediction of stationary processes and Yule-Walker equations and parameter estimation for autoregressive processes. 2000 Mathematics Subject Classification. Primary 65-XX, 65-04.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Applications of the Generalized Fourier Transform in Numerical Linear Algebra

Matrices equivariant under a group of permutation matrices are considered. Such matrices typically arise in numerical applications where the computational domain exhibits geometrical symmetries. In these cases, group representation theory provides a powerful tool for block diagonalizing the matrix via the Generalized Fourier Transform. This technique yields substantial computational savings in ...

متن کامل

Eigenvalues for Equivariant Matrices

An equivariant matrix A commutes with a group of permutation matrices. Such matrices often arise in numerical applications where the computational domain exhibits geometrical symmetries, for instance triangles, cubes, or icosahedra. The theory for block diagonalizing equivariant matrices via the Generalized Fourier Transform (GFT) is reviewed and applied to eigenvalue computations. For dense ma...

متن کامل

An Approach to Deriving Maximal Invariant Statistics

Invariance principles is one of the ways to summarize sample information and by these principles invariance or equivariance decision rules are used. In this paper, first, the methods for finding the maximal invariant function are introduced. As a new method, maximal invariant statistics are constructed using equivariant functions. Then, using several equivariant functions, the maximal invariant...

متن کامل

Structure of Wavelet Covariance Matrices and Bayesian Wavelet Estimation of Autoregressive Moving Average Model with Long Memory Parameter’s

In the process of exploring and recognizing of statistical communities, the analysis of data obtained from these communities is considered essential. One of appropriate methods for data analysis is the structural study of the function fitting by these data. Wavelet transformation is one of the most powerful tool in analysis of these functions and structure of wavelet coefficients are very impor...

متن کامل

Sparse Generalized Fourier Transforms ∗

Block-diagonalization of sparse equivariant discretization matrices is studied. Such matrices typically arise when partial differential equations that evolve in symmetric geometries are discretized via the finite element method or via finite differences. By considering sparse equivariant matrices as equivariant graphs, we identify a condition for when block-diagonalization via a sparse variant ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999